Computational complexity theory - PDFSEARCH.IO - Document Search Engine

Computational complexity theory
Results: 2049

#	Item
471	CCCG 2011, Toronto ON, August 10–12, 2011 Robust approximate assembly partitioning Elisha Sacks∗ Victor Milenkovic† Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:12 Analysis of algorithms Computational complexity theory Convex geometry Digital geometry Minkowski addition Algorithm Time complexity Mathematics Theoretical computer science Geometry
472	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 A PTAS for the continuous 1.5D Terrain Guarding Problem Stephan Friedrichs∗ Michael Hemmer∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-07-28 18:32:50 Group theory Order Optimization problem NP-complete problems Network flow Combinatorial optimization Theoretical computer science Mathematics Computational complexity theory
473	On Two Class-Constrained Versions of the Multiple Knapsack Problem ∗ Hadas Shachnai † Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2013-04-15 10:32:13 Operations research Combinatorial optimization NP-complete problems Mathematical optimization Dynamic programming Knapsack problem Job shop scheduling Optimization problem Polynomial-time approximation scheme Theoretical computer science Computational complexity theory Applied mathematics
474	Uniform Generation of NP-witnesses using an NP-oracle Mihir Bellare Oded Goldreichy Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2014-06-22 06:24:53 Complexity classes Probabilistic complexity theory Quantum complexity theory Analysis of algorithms Randomized algorithm PP NP P Theoretical computer science Computational complexity theory Applied mathematics
475	CCCG 2011, Toronto ON, August 10–12, 2011 Space-efficient Algorithms for Empty Space Recognition among a Point Set in 2D and 3D Minati De∗† Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:13 Largest empty rectangle Algorithm Closest pair of points problem Reduction Computer science Computational geometry Beta skeleton Mathematics Applied mathematics Computational complexity theory
476	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 Time, space, and precision: Revisiting classic problems in computational geometry with degree-driven analysis Jack Snoeyink∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-08-04 14:37:40 Analysis of algorithms Computational complexity theory Computer arithmetic Algorithm Mathematical logic Floating point Computational geometry Time complexity Model of computation Theoretical computer science Applied mathematics Computer science
477	Presburger Award 2012 The Presburger Award Committee 2012, consisting of Monika Henzinger, Antonin Kucera, and Stefano Leonardi (chair) has unanimously decided to propose *********************************************** Add to Reading List Source URL: www.eatcs.org Language: English - Date: 2014-01-29 10:45:05** Applied mathematics Mathematics Computational complexity theory List decoding Venkatesan Guruswami Probabilistic complexity theory Presburger Award Reed–Solomon error correction Probabilistically checkable proof Error detection and correction Theoretical computer science Coding theory
478	ICS 161 — Algorithms — Spring 2005 — Final Exam Please answer the following eight questions on the answer sheets provided. Answers written on other pages or on the wrong sheet will not be scored. Be sure to write y Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2005-06-13 12:44:12 NP-complete problems Vertex cover NP-complete Longest common subsequence problem Minimum spanning tree Algorithm Path decomposition Edge coloring Theoretical computer science Computational complexity theory Mathematics
479	On the possibility of faster SAT algorithms Mihai Pˇatra¸scu∗ AT&T Labs Florham Park, NJ Ryan Williams† Add to Reading List Source URL: www.stanford.edu Language: English - Date: 2009-11-12 23:47:30 NP-complete problems Logic in computer science Exponential time hypothesis 2-satisfiability Boolean satisfiability problem Conjunctive normal form Time complexity Parameterized complexity Dominating set Theoretical computer science Computational complexity theory Applied mathematics
480	Toward A Taxonomy of “Small” Genres and Writing Techniques for WAC Add to Reading List Source URL: wac.colostate.edu Language: English - Date: 2010-12-27 11:56:40 Pedagogy Philosophy of education Computational complexity theory Reduction Rote learning Eleanor Duckworth Inquiry-based learning Education Educational psychology Education reform

UPDATE